The Zeckendorf Expansion of Polynomial Sequences
نویسنده
چکیده
In the first part of the paper we prove that the Zeckendorf sum-ofdigits function sZ(n) and similarly defined functions evaluated on polynomial sequences of positive integers or primes satisfy a central limit theorem. We also prove that the Zeckendorf expansion and the q-ary expansions of integers are asymptotically independent.
منابع مشابه
The Joint Distribution of Greedy and Lazy Fibonacci Expansions
with digits k ∈ {0, 1}. The maximal expansion with respect to the lexicographic order on (. . . , 4, 3, 2) is the Zeckendorf expansion or, more generally, the greedy expansion, which has been studied by Zeckendorf [7] and many others. (Lexicographic order means (. . . , 3, 2) < (. . . , 3, ′ 2) if k < ′ k for some k ≥ 2 and j ≤ j for all j ≥ k.) The minimal expansion with respect to this order ...
متن کاملGeneralizations of the Dual Zeckendorf Integer Representation Theorems—discovery by Fibonacci Trees and Word Patterns
In this paper we show how the two well-known integer representation theorems which are associated with the name of Zeckendorf may be generalized as dual systems by constructing colored tree sequences whose shade sets partition Z = {1, 2, . . . } . Many interesting properties of the representations can be observed directly from the tree diagrams, and the proofs of the properties can truly be sai...
متن کاملExpansion methods for solving integral equations with multiple time lags using Bernstein polynomial of the second kind
In this paper, the Bernstein polynomials are used to approximate the solutions of linear integral equations with multiple time lags (IEMTL) through expansion methods (collocation method, partition method, Galerkin method). The method is discussed in detail and illustrated by solving some numerical examples. Comparison between the exact and approximated results obtained from these methods is car...
متن کاملOn Pascal’s Triangle modulo 2 in Fibonacci Representation
In the present paper we consider an analogous problem, but instead of using the binary number system as Hewgill did, we interpret every second row of modulo 2 reduced Pascal’s triangle in the Fibonacci number system. Moreover, we are interested about the whole family of sequences where the even indexed rows specify the most significant digits (“fibits”) of the Zeckendorf expansion of an integer...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002